Hierarchical Substructuring Combined with Svd-based Model Reduction Methods

نویسنده

  • FRANK BLÖMELING
چکیده

The direct applicability of SVD-based methods in model reduction of large linear systems is very limited. However, substructuring methods are a possibility to use these approaches. A method called Automated Multilevel Substructuring (AMLS) has been successfully applied to eigenvalue computations of very large systems. We present a similar substructuring approach for linear time-invariant (LTI) systems and its combination with model reduction techniques. Because the reduction methods are only applied to arising significantly smaller subsystems, particularly SVDbased methods are used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing Computational and Memory Cost of Substructuring Technique in Finite Element Models

Substructuring in the finite element method is a technique that reduces computational cost and memory usage for analysis of complex structures. The efficiency of this technique depends on the number of substructures in different problems. Some subdivisions increase computational cost, but require little memory usage and vice versa. In the present study, the cost functions of computations and me...

متن کامل

Hierarchical Clustering Beyond the Worst-Case

Hiererachical clustering, that is computing a recursive partitioning of a dataset to obtain clusters at increasingly finer granularity is a fundamental problem in data analysis. Although hierarchical clustering has mostly been studied through procedures such as linkage algorithms, or top-down heuristics, rather than as optimization problems, recently Dasgupta [1] proposed an objective function ...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

3D Image Representation through Hierarchical Tensor Decomposition, Based on SVD with Elementary Tensor of size 222

As it is known, groups of correlated 2D images of various kind could be represented as 3D images, which are mathematically described as 3 rd order tensors. Various generalizations of the Singular Value Decomposition (SVD) exist, aimed at the tensor description reduction. In this work, new approach is presented for 3 rd order tensor decomposition, where unlike the famous methods for decompositio...

متن کامل

Feature Extraction of Visual Evoked Potentials Using Wavelet Transform and Singular Value Decomposition

Introduction: Brain visual evoked potential (VEP) signals are commonly known to be accompanied by high levels of background noise typically from the spontaneous background brain activity of electroencephalography (EEG) signals. Material and Methods: A model based on dyadic filter bank, discrete wavelet transform (DWT), and singular value decomposition (SVD) was developed to analyze the raw data...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006